Kernel representations for behaviors over finite rings
نویسندگان
چکیده
In behavioral theory, a central role is played by the set B of trajectories that belong to a dynamical system Σ, see the textbook [11]. In fact, the dynamical system is defined as a triple Σ = (T,W,B), where T is the time axis, W is the signal alphabet, and where B, the behavior of the system, is a subset of W. In this paper we consider dynamical systems Σ = (Z+,R ,B), where R is the ring Zpr . Here p is a prime number and r is a positive integer. We study the theory of representations for such systems, in particular kernel representations (defined below).
منابع مشابه
Behavioral Models over Rings—minimal Representations and Applications to Coding and Sequences
In this paper we consider polynomial kernel representations for behaviors. For behaviors over fields it is well-known that minimal representations, i.e. representations with minimal row degrees, are exactly those representations for which the polynomial matrix is row reduced. In this paper we consider behaviors over a particular type of ring, namely Zpr , where p is a prime number and r is a po...
متن کاملParametrized Linear
In the behavioral approach a dynamical system is essentially determined by a set of trajectories B, which is called behavior. There exist various ways for representing behaviors that are linear and shift-invariant: kernel representations, image representations and latent variable representations. In this paper we deal with families of parametrized linear shift-invariant behaviors and with the p...
متن کاملMinimal State Diagrams for Controllable Behaviors over Finite Rings
In this paper we consider controllable behaviors over Zpr that admit an image representation which has a Laurent polynomial left inverse. We solve the problem of determining a minimal state diagram representation for such behaviors. Using the concept of p-basis for submodules of Zpr [z], that was introduced in (Kuijper et al., 2007), we define an expanded type of image representations for the g...
متن کاملLinear representations of convolutional codes over rings
In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for which these representations always exist, and we show that finite products of finite fields belong to this class. We develop the input/state/output represen...
متن کاملUnramified Representations of Reductive Groups over Finite Rings
Lusztig has given a construction of certain representations of reductive groups over finite local principal ideal rings of characteristic p, extending the construction of Deligne and Lusztig of representations of reductive groups over finite fields. We generalize Lusztig’s results to reductive groups over arbitrary finite local rings. This generalization uses the Greenberg functor and the theor...
متن کامل